Applied Foundations: Proof Mining in Mathematics Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade

Source URL: www.mathematik.tu-darmstadt.de

• Logic
• Proof theory
• Mathematical logic
• Mathematics
• Proof mining
• Mathematical proof
• Consistency
• Constructive proof
• Formal proof
• Intuitionistic logic
• Approximation
• Type theory

Variable Metric Stochastic Approximation Theory Peter Sunehag∗ Jochen Trumpf

Source URL: nic.schraudolph.org

Nonlinear approximation theory on finite groups K.-L. Kueh∗ T. Olson† D. Rockmore‡ K.-S. Tan§ November 21, 1999

Source URL: www.cs.dartmouth.edu

ALGEBRAIC STRUCTURE AND DEGREE REDUCTION Let S ⊂ Fn . We define deg(S) to be the minimal degree of a non-zero polynomial that vanishes on S. We have seen that for a finite set S, deg(S) ≤ n|S|1/n . In fact, we can sa

Source URL: math.mit.edu

• Mathematics
• Mathematical analysis
• Algebra
• Polynomials
• Transcendental numbers
• Diophantine approximation
• Coding theory
• Algebraic function
• Elliptic curve

Fast Randomized Kernel Ridge Regression with Statistical Guarantees∗ Ahmed El Alaoui † Michael W. Mahoney ‡ † Electrical Engineering and Computer Sciences ‡ Statistics and International Computer Science Institu

Source URL: www.stat.berkeley.edu

• Algebra
• Linear algebra
• Mathematics
• Matrix theory
• Numerical linear algebra
• Functional analysis
• Mathematical physics
• Normal distribution
• Low-rank approximation
• Eigendecomposition of a matrix
• Eigenvalues and eigenvectors
• Matrix

Chapter 15 The tools of time-dependent perturbation theory can be applied to transitions among electronic, vibrational, and rotational states of molecules. I. Rotational Transitions Within the approximation that the elec

Source URL: simons.hec.utah.edu

The use of a logical principle of uniform boundedness in analysis Ulrich Kohlenbach Department of Mathematics University of Michigan Ann Arbor

Source URL: www.mathematik.tu-darmstadt.de

• Mathematical analysis
• Mathematics
• Analysis
• Functional analysis
• Approximation theory
• Constructivism
• Fourier analysis
• Modulus of continuity
• Uniform boundedness principle
• Substitution
• Continuous function

Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma †

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Computational complexity theory
• Spanning tree
• NP-complete problems
• Dominating set
• Minimum spanning tree
• Maximal independent set
• Matching
• Travelling salesman problem
• Shortest path problem
• Tree

Elementary Aspects of the Verlinde Formula and of the Harder-Narasimhan-Atiyah-Bott Formula Don Zagier

Source URL: people.mpim-bonn.mpg.de

• Mathematical analysis
• Mathematics
• Analysis
• Orthogonal polynomials
• Integer sequences
• Polynomials
• Approximation theory
• Chebyshev polynomials
• Generating function
• Bessel function
• Bernoulli number
• Binomial coefficient

Part II: Interpolation and Approximation theory Contents: 1 Review of Lagrange interpolation polynomials

Source URL: www.maths.dit.ie